Measuring the Similarity of Geometric Graphs
Identifieur interne : 000945 ( Main/Exploration ); précédent : 000944; suivant : 000946Measuring the Similarity of Geometric Graphs
Auteurs : Otfried Cheong [Corée du Sud] ; Joachim Gudmundsson [Australie] ; Hyo-Sil Kim [Corée du Sud] ; Daria Schymura [Allemagne] ; Fabian Stehn [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.
Url:
DOI: 10.1007/978-3-642-02011-7_11
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B92
- to stream Istex, to step Curation: 000B77
- to stream Istex, to step Checkpoint: 000467
- to stream Main, to step Merge: 000953
- to stream Main, to step Curation: 000945
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Measuring the Similarity of Geometric Graphs</title><author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name></author><author><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name></author><author><name sortKey="Kim, Hyo Sil" sort="Kim, Hyo Sil" uniqKey="Kim H" first="Hyo-Sil" last="Kim">Hyo-Sil Kim</name></author><author><name sortKey="Schymura, Daria" sort="Schymura, Daria" uniqKey="Schymura D" first="Daria" last="Schymura">Daria Schymura</name></author><author><name sortKey="Stehn, Fabian" sort="Stehn, Fabian" uniqKey="Stehn F" first="Fabian" last="Stehn">Fabian Stehn</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A97216B68C4EC5DD1A57B90755EFDAD8512FDFBB</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-02011-7_11</idno><idno type="url">https://api.istex.fr/document/A97216B68C4EC5DD1A57B90755EFDAD8512FDFBB/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B92</idno><idno type="wicri:Area/Istex/Curation">000B77</idno><idno type="wicri:Area/Istex/Checkpoint">000467</idno><idno type="wicri:doubleKey">0302-9743:2009:Cheong O:measuring:the:similarity</idno><idno type="wicri:Area/Main/Merge">000953</idno><idno type="wicri:Area/Main/Curation">000945</idno><idno type="wicri:Area/Main/Exploration">000945</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Measuring the Similarity of Geometric Graphs</title><author><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>KAIST</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Corée du Sud</country></affiliation></author><author><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name><affiliation wicri:level="1"><country xml:lang="fr">Australie</country><wicri:regionArea>NICTA</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Australie</country></affiliation></author><author><name sortKey="Kim, Hyo Sil" sort="Kim, Hyo Sil" uniqKey="Kim H" first="Hyo-Sil" last="Kim">Hyo-Sil Kim</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>KAIST</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Corée du Sud</country></affiliation></author><author><name sortKey="Schymura, Daria" sort="Schymura, Daria" uniqKey="Schymura D" first="Daria" last="Schymura">Daria Schymura</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FU Berlin</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Stehn, Fabian" sort="Stehn, Fabian" uniqKey="Stehn F" first="Fabian" last="Stehn">Fabian Stehn</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>FU Berlin</wicri:regionArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A97216B68C4EC5DD1A57B90755EFDAD8512FDFBB</idno><idno type="DOI">10.1007/978-3-642-02011-7_11</idno><idno type="ChapterID">11</idno><idno type="ChapterID">Chap11</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer linear program. We also present experiments using a heuristic distance function.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>Australie</li><li>Corée du Sud</li></country></list><tree><country name="Corée du Sud"><noRegion><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name></noRegion><name sortKey="Cheong, Otfried" sort="Cheong, Otfried" uniqKey="Cheong O" first="Otfried" last="Cheong">Otfried Cheong</name><name sortKey="Kim, Hyo Sil" sort="Kim, Hyo Sil" uniqKey="Kim H" first="Hyo-Sil" last="Kim">Hyo-Sil Kim</name><name sortKey="Kim, Hyo Sil" sort="Kim, Hyo Sil" uniqKey="Kim H" first="Hyo-Sil" last="Kim">Hyo-Sil Kim</name></country><country name="Australie"><noRegion><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name></noRegion><name sortKey="Gudmundsson, Joachim" sort="Gudmundsson, Joachim" uniqKey="Gudmundsson J" first="Joachim" last="Gudmundsson">Joachim Gudmundsson</name></country><country name="Allemagne"><noRegion><name sortKey="Schymura, Daria" sort="Schymura, Daria" uniqKey="Schymura D" first="Daria" last="Schymura">Daria Schymura</name></noRegion><name sortKey="Schymura, Daria" sort="Schymura, Daria" uniqKey="Schymura D" first="Daria" last="Schymura">Daria Schymura</name><name sortKey="Stehn, Fabian" sort="Stehn, Fabian" uniqKey="Stehn F" first="Fabian" last="Stehn">Fabian Stehn</name><name sortKey="Stehn, Fabian" sort="Stehn, Fabian" uniqKey="Stehn F" first="Fabian" last="Stehn">Fabian Stehn</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000945 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000945 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A97216B68C4EC5DD1A57B90755EFDAD8512FDFBB
|texte= Measuring the Similarity of Geometric Graphs
}}
| This area was generated with Dilib version V0.6.32. |  |